Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles
نویسندگان
چکیده
منابع مشابه
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
We prove that, for the black hole search problem, the pure token model is computationally as powerful as the whiteboard model; furthermore the complexity is exactly the same. More precisely, we prove that a team of two asynchronous agents, each endowed with a single identical pebble (that can be placed only on nodes, and with no more than one pebble per node) can locate the black hole in an arb...
متن کاملSynchronous black hole search in directed graphs
The paper considers a team of robots which has to explore a graphG where some nodes can be harmful. Robots are initially located at the so called home base node. The dangerous nodes are the so called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that the minimum number of robots is wasted. The explor...
متن کاملBlack Hole Search in Directed Graphs
We consider the problem of cooperative network exploration by agents under the assumption that there is a harmful host present in the network that destroys the incoming agents without outside trace – the so-called black hole search problem. Many variants of this problem have been studied, with various assumptions about the timing, agents’ knowledge about the topology, means of inter-agent commu...
متن کاملPing pong in the pore
Getting to the inner circle ontiguity between the ER and the nuclear envelope means nuclear membrane proteins have a direct shot to their target. In fact, inner nuclear membrane (INM) proteins were thought to need only to diffuse to the nucleus, pass through the nuclear pore, and then be retained by nuclear-localized binding partners. But new results suggest a more active process. Suraj Saksena...
متن کاملPing-Pong: Musically Discovering Locations
A recently developed system that uses pitched sounds to discover relative 3D positions of a group of devices located in a shared physical space is described. The measurements are coordinated over an IP network in a decentralized manner, while the actual measurements are carried out measuring the time-of-flight of the notes played by different devices. Approaches to sonify the discovery process ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2011
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-011-9496-3